منابع مشابه
Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملOn upper bound graphs whose complements are also upper bound graphs
In this paper, we consider upper bound graphs and double bound graphs of posets. We obtain a characterization of upper bound graphs whose complements are also upper bound graphs as follows: for a connected graph G, both G and G are upper bound graphs if and only if G is a split graph with V(G)= K + S, where K is a clique and S is an independent set, satisfying one of the following conditions: (...
متن کاملOn Distances of Posets with the Same Upper Bound Graphs
In this paper, we consider transformations for posets with the same upper bound graph. Those $poset_{8}$ can be $tran8formed$ into each other by a finite sequence of two kinds of transformations, called addition and deletion of an order relation. This result induces a characterization on unique upper bound graphs. We deal with the distance of those posets that have the same upper bound graph. I...
متن کاملDistances between graphs under edge operations
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge operations: the edge move, rotation and slide distances. We derive relations between the metrics, and bounds on the distance between arbitrary graphs and between arbitrary trees. We also consider the sensitivity of the metrics to various graph operations. Correspondence to: Wayne Goddard Dept of Compu...
متن کاملAn upper bound for the regularity of powers of edge ideals
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tokyo Journal of Mathematics
سال: 2008
ISSN: 0387-3870
DOI: 10.3836/tjm/1233844068